Weak Integer Additive Set-Indexers of Certain Graph Products
نویسندگان
چکیده
An integer additive set-indexer is defined as an injective function f : V (G) → 2N0 such that the induced function gf : E(G) → 2N0 defined by gf (uv) = f(u) + f(v) is also injective, where f(u) + f(v) is the sumset of f(u) and f(v). If gf (uv) = k ∀ uv ∈ E(G), then f is said to be a k-uniform integer additive set-indexers. An integer additive set-indexer f is said to be a weak integer additive set-indexer if |gf (uv)| = max(|f(u)|, |f(v)|) ∀ uv ∈ E(G). We have some characteristics of the graphs which admit weak integer additive set-indexers. We already have some results on the admissibility of weak integer additive set-indexer by certain graphs and finite graph operations. In this paper, we study further characteristics of certain graph products like cartesian product and corona of two weak IASI graphs and their admissibility of weak integer additive set-indexers and provide some useful results on these types of set-indexers.
منابع مشابه
Weak Set-Labeling Number of Certain Integer Additive Set-Labeled Graphs
Let N0 be the set of all non-negative integers, let X N0 and P(X) be the the power set of X. An integer additive set-labeling (IASL) of a graph G is an injective function f : V (G) ! P(N0) such that the induced function f+ : E(G) ! P(N0) is defined by f+(uv) = f(u) + f(v), where f(u) + f(v) is the sum set of f(u) and f(v). An IASL f is said to be an integer additive set-indexer (IASI) of a grap...
متن کاملA study on prime arithmetic integer additive set-indexers of graphs
Let N0 be the set of all non-negative integers and P(N0) be its power set. An integer additive set-indexer (IASI) is defined as an injective function f : V (G) → P(N0) such that the induced function f : E(G)→ P(N0) defined by f(uv) = f(u)+f(v) is also injective, where N0 is the set of all non-negative integers. A graph G which admits an IASI is called an IASI graph. An IASI of a graph G is said...
متن کاملA Study on the Nourishing Number of Graphs and Graph Powers
Let N0 be the set of all non-negative integers and P(N0) be its power set. Then, an integer additive set-indexer (IASI) of a given graph G is defined as an injective function f : V (G) → P(N0) such that the induced edge-function f : E(G) → P(N0) defined by f(uv) = f(u) + f(v) is also injective, where f(u) + f(v) is the sumset of f(u) and f(v). An IASI f of G is said to be a strong IASI of G if ...
متن کاملOn the Sparing Number of the Edge-Corona of Graphs
Let N0 be the set of all non-negative integers and P(N0) be its the power set. An integer additive set-indexer (IASI) of a graph G is an injective function f : V (G) ! P(N0) such that the induced function f+ : E(G) ! P(N0) defined by f+(uv) = f(u) + f(v) is also injective, where f(u) + f(v) is the sum set of f(u) and f(v). An integer additive set-indexer f is said to be a weak integer additive ...
متن کاملSome New Results on Weak Integer Additive Set-Labeling of Graphs
Let N0 denote the set of all non-negative integers and P(N0) be its power set. An integer additive set-labeling (IASL) of a graph G is an injective function f : V (G) → P(N0) such that the induced function f : E(G)→ P(N0) is defined by f(uv) = f(u)+f(v), where f(u)+f(v) is the sumset of f(u) and f(v). An IASL f is said to be an integer additive set-indexer (IASI) if the associated edge-function...
متن کامل